Free group languages: Rational versus recognizable
نویسنده
چکیده
منابع مشابه
Star-connected rational expressions
Star-connected rational expressions were considered only as expressions defining trace languages. In this paper we continue the study of the class of flat languages defined by this kind of rational expressions (see [5], [4]). We obtain stronger results and prove that any language is star-connected iff it is accepted by a finite automaton with cycles which are proper composition of connected cyc...
متن کاملOn Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملOn Recognizable Languages in Left Divisibility Monoids
We describe a class of monoids where c-rational languages can be deened analogously to trace theory and where these languages are precisely the recognizable ones. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to our left divisibility monoids. We obtain Ochma nski's theorem on recognizable languages in free partially commutative mo...
متن کاملA Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have only one concatenation operation and only one star-operation, instead of many different ones. This is achieved by considering forests instead of trees over a ranked alphabet, or, algebraicly speaking, by considering cart...
متن کاملLogic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N -free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled N -free finite and ω-posets and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 38 شماره
صفحات -
تاریخ انتشار 2004